A Distributed Memory Parallel Fourth-Order IADEMF Algorithm
نویسندگان
چکیده
منابع مشابه
A Fast, Parallel Performance of Fourth Order Iterative Algorithm on Shared Memory Multiprocessors (SMP) Architecture
The rotated fourth order iterative algorithm of O(h4) accuracy applied to linear system arising from the discretization of two dimensional Poisson problem was introduced by Othman, et al., 2001 and it was shown to be the fastest as compared to the standard fourth order iterative algorithm, see Gupta, 1984. While the parallel standard fourth order iterative algorithm was implemented successfully...
متن کاملA Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver
In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملA Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing the coloring itself in parallel. The algorithm operates in an iterative fashion; in each round vertices are speculatively colored based on limited information, and then a set of incorrectly colored vertices, to be reco...
متن کاملA Scalable Parallel Union-Find Algorithm for Distributed Memory Computers
The Union-Find algorithm is used for maintaining a number of non-overlapping sets from a finite universe of elements. The algorithm has applications in a number of areas including the computation of spanning trees, in image processing, as well as in scientific computations. Although the algorithm is inherently sequential there has been some previous efforts at constructing parallel implementati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2019
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2019.0100979